Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
321	ICS 161 — Algorithms — Spring 2005 — Final Exam Please answer the following eight questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to write y Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-06-13 12:44:12 NP-complete problems Vertex cover NP-complete Longest common subsequence problem Minimum spanning tree Algorithm Path decomposition Edge coloring Theoretical computer science Computational complexity theory Mathematics
322	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics
323	16th Canadian Conference on Computational Geometry, 2004 Tiling Layouts with Dominoes Chris Worman Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Recreational mathematics Domino problem Domino tiling Dominoes Wang tile Tessellation Domino Polyomino Tile-based game Mathematics Tiling Geometry
324	Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772) Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:25 NP-complete problems Approximation algorithm Vertex cover Travelling salesman problem Graph coloring Metric k-center Dynamic programming Christofides algorithm Set cover problem Theoretical computer science Mathematics Computational complexity theory
325	informs MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxxx 20xx, pp. xxx–xxx ISSN 0364-765X \| EISSN \|xx\|0000\|0xxx Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-09-10 09:13:15 Operations research Submodular set function Computational complexity theory Linear programming Randomized rounding Continuous function Optimization problem Mathematical optimization Time complexity Theoretical computer science Mathematics Applied mathematics
326	CS 373: Combinatorial Algorithms, Fall 2000 Homework 6 (due December 7, 2000 at midnight) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:14 NP-complete problems Complexity classes NP-complete NP-hard NP Maximum cut Shortest path problem Travelling salesman problem P-complete Theoretical computer science Computational complexity theory Mathematics
327	CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 6 (due Tue. May 1, 2001 at 11:59.99 p.m.) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:35 NP-complete problems Complexity classes NP-complete NP-hard NP Travelling salesman problem Vertex cover Maximum cut Shortest path problem Theoretical computer science Computational complexity theory Mathematics
328	16th Canadian Conference on Computational Geometry, 2004 ˝ A remark on the Erdos–Szekeres theorem Adrian Dumitrescu Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Discrete geometry Convex analysis Euclidean plane geometry Ramsey theory Convex hull Convex set Polygon Happy Ending problem Convex function Geometry Mathematics Convex geometry
329	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:26 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Time complexity Approximation algorithm Rectilinear Steiner tree Theoretical computer science Graph theory Computational complexity theory
330	ICS 260 – Fall 2001 – Final Exam Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:38 Complexity classes NP-complete problems Mathematical optimization Operations research Travelling salesman problem NP Induced path Independent set Directed acyclic graph Theoretical computer science Graph theory Computational complexity theory

UPDATE